Description: 利用遗传算法求解TSP问题。TSP问题描述如下：给定一组n个城市和他们两两之间地直达距离，寻找一条闭合的旅程，使得每个城市刚好经过一次而且总的旅行距离最短。
-The use of genetic algorithm to solve TSP problems. TSP problem described as follows: given a set of n cities and their 22 direct distance between the places to find a closure of the journey, makes each city just after the total travel time and the shortest distance. Platform: |
Size: 185344 |
Author:杜红艳 |
Hits:
Search - GA TSP OLI 30 ja